New Orthogonal Small Set Kasami Code Sequence

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Approach of Designing Spreading Code using Genetic Algorithm

Modern communication systems extensively use Code Division Multiple Access (CDMA) technology that associates one unique code to each user. Therefore the generation of these spreading codes has drawn considerable attention amongst the researchers with a fundamental requirement of having as much distinct members as possible along with a constraint of minimizing the inter-code correlation. Since t...

متن کامل

BER improvement of DS-CDMA for AWGN and Rayleigh fading channel with Kasami code

In this paper we represent the work to improve the quality or reducing the effective BER in a multipath fading channel. BER is inversely proportional to SNR so high SNR results in low BER and vice versa. The study of this paper is to have focus on the performance of digital communication system. For reliable communication system, its BER should be as low as possible i.e. improvement in BER. BER...

متن کامل

On Kasami Bent Functions

It is proved that no non-quadratic Kasami bent is affine equivalent to MaioranaMacFarland type bent functions.

متن کامل

On Pseudo-Random and Orthogonal Binary Spreading Sequences

Different pseudo-random or pseudo-noise (PN) as well as orthogonal sequences that can be used as spreading codes for code division multiple access (CDMA) cellular networks or can be used for encrypting speech signals to reduce the residual intelligence are investigated. We briefly review the theoretical background for direct sequence CDMA systems and describe the main characteristics of the max...

متن کامل

A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions

Based on a sufficient condition proposed by Hollmann and Xiang forconstructing triple-error-correcting codes, the minimum distance of a binary cycliccodeC1,3,13 with three zeros α, α3, and α13 of length 2−1 and the weight divisibilityof its dual code are studied, where m ≥ 5 is odd and α is a primitive element of thefinite field F2m . The codeC1,3,13 is proven to hav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Majalah Ilmiah Teknologi Elektro

سال: 2015

ISSN: 2503-2372,1693-2951

DOI: 10.24843/mite.2015.v14i01p10